Compositional model analysis

Parameterized Compositional Model Checking

The Parameterized Compositional Model Checking Problem (PCMCP) is to decide, using compositional proofs, whether a property holds for every instance of a parameterized family of process networks. Compositional analysis focuses attention on the neighborhood structure of processes in the network family. For the verification of safety properties, the PCMCP is shown to be much more tractable than t...

Compositional Model Checking

Modern software, which is often concurrent and distributed, must be extremely reliable and correct. Model checking [3] is a technique for automating high-quality assurance of software. Given a finite state model of a system and a property, usually expressed as an automaton or a temporal logic formula, model checking systematically goes through all the possible system behaviors and checks them f...

Compositional Model Checking

We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general fram...

Compositional Expectation: A Purely Distributional Model of Compositional Semantics

Induction in Compositional Model Checking

This paper describes a technique of inductive proof based on model checking. It differs from previous techniques that combine induction and model checking in that the proof is fully mechanically checked and temporal variables (process identifiers, for example) may be natural numbers. To prove ∀n.φ(n) inductively, the predicate φ(n − 1) ⇒ φ(n) must be proved for all values of the parameter n. It...